Multi-coloring the Mycielskian of graphs
نویسندگان
چکیده
A k-fold coloring of a graph is a function that assigns to each vertex a set of k colors, so that the color sets assigned to adjacent Contract grant sponsor: NSFC; Contract grant number: 10671033 (to W.L.); Contract grant sponsor: National Science Foundation; Contract grant number: DMS 0302456 (to D.D.L.); Contract grant sponsor: National Science Council; Contract grant number: NSC95-2115-M-110-013-MY3 (to X.Z.). Journal of Graph Theory 2009 Wiley Periodicals, Inc.
منابع مشابه
Degree distance index of the Mycielskian and its complement
In this paper, we determine the degree distance of the complement of arbitrary Mycielskian graphs. It is well known that almost all graphs have diameter two. We determine this graphical invariant for the Mycielskian of graphs with diameter two.
متن کاملCircular coloring and Mycielski construction
In this paper, we investigate circular chromatic number of Mycielski construction of graphs. It was shown in [20] that t Mycielskian of the Kneser graph KG(m,n) has the same circular chromatic number and chromatic number provided that m + t is an even integer. We prove that if m is large enough, then χ(M (KG(m,n))) = χc(M (KG(m,n))) where M t is t Mycielskian. Also, we consider the generalized ...
متن کاملSimple Graphs as Simplicial Complexes: the Mycielskian of a Graph
Harary [10, p. 7] claims that Veblen [20, p. 2] first suggested to formalize simple graphs using simplicial complexes. We have developed basic terminology for simple graphs as at most 1-dimensional complexes. We formalize this new setting and then reprove Mycielski’s [12] construction resulting in a triangle-free graph with arbitrarily large chromatic number. A different formalization of simila...
متن کاملOn Fall Colorings of Graphs
A fall k-coloring of a graph G is a proper k-coloring of G such that each vertex of G sees all k colors on its closed neighborhood. We denote Fall(G) the set of all positive integers k for which G has a fall k-coloring. In this paper, we study fall colorings of lexicographic product of graphs and categorical product of graphs and answer a question of [3] about fall colorings of categorical prod...
متن کاملMulti-coloring and Mycielski’s construction
We consider a number of related results taken from two papers – one by W. Lin [1], and the other D. C. Fisher[2]. These articles treat various forms of graph colorings and the famous Mycielski construction. Recall that the Mycielskian μ(G) of a simple graph G is a graph whose chromatic number satisfies χ(μ(G)) = χ(G)+1, but whose largest clique is no larger than the largest clique in G. Extendi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 63 شماره
صفحات -
تاریخ انتشار 2010